Joint Source-Channel Coding for Arbitrarily Varying Wyner-Ziv Source and Gel’fand-Pinsker Channel

نویسندگان

  • Amir Winshtok
  • Yossef Steinberg
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Joint Source-Channel Coding for the Arbitrarily Varying Wyner-Ziv Source and Gel'fand-Pinsker Channel

In this work we characterize the rate-distortion function of a Wyner-Ziv source, depending on an arbitrarily varying state, known non-causally at the encoder. We then consider the problem of joint source-channel coding of this source transmitted over an arbitrarily varying Gel’fand-Pinsker channel, where we assume that one jammer controls both, the source state sequence and the channel state se...

متن کامل

Joint Wyner - Ziv / Dirty - Paper Coding by Analog Modulo - Lattice Modulation †

In this work we show how source coding with decoder side-information (Wyner-Ziv problem) and channel coding with encoder side-infotmation (Gel’fand-Pinsker problem) can be merged into a single joint source/channel scheme in the quadratic Gaussian case (where the channel is known as the dirty paper channel). This scheme achieves the optimal performance RWZ(D) = CDPC without using any information...

متن کامل

Joint Wyner-Ziv/Dirty Paper coding by modulo-lattice modulation

The combination of source coding with decoder side-information (Wyner-Ziv problem) and channel coding with encoder side-information (Gel’fand-Pinsker problem) can be optimally solved using the separation principle. In this work we show an alternative scheme for the quadratic-Gaussian case, which merges source and channel coding. This scheme achieves the optimal performance by a applying modulo-...

متن کامل

Achievable Secrecy Rate Regions of State Dependent Causal Cognitive Interference Channel

In this paper, the secrecy problem in the state dependent causal cognitive interference channel is studied. The channel state is non-causally known at the cognitive encoder. The message of the cognitive encoder must be kept secret from the primary receiver. We use a coding scheme which is a combination of compress-and-forward strategy with Marton coding, Gel’fand-Pinsker coding and Wyner’s wire...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006